翻訳と辞書 Words near each other ・ Szymanowice Górne ・ Szymanowice Małe ・ Szymanowice, Greater Poland Voivodeship ・ Szymanowice, Legnica County ・ Szymanowice, Łódź Voivodeship ・ Szymanowice, Środa Śląska County ・ Szymanowizna ・ Szymanowo ・ Szymanowo, Lublin Voivodeship ・ Szymanowo, Mrągowo County ・ Szymanowo, Ostróda County ・ Szymanowo, Rawicz County ・ Szymanowo, Szamotuły County ・ Szymanowo, Śrem County ・ Szymanowski ・ Szymanski's conjecture ・ Szymany ・ Szymany, Gmina Grajewo ・ Szymany, Gmina Wąsosz ・ Szymany, Greater Poland Voivodeship ・ Szymany, Nidzica County ・ Szymany, Szczytno County ・ Szymany-Kolonie ・ Szymanów ・ Szymanów, Greater Poland Voivodeship ・ Szymanów, Lipsko County ・ Szymanów, Piaseczno County ・ Szymanów, Sochaczew County ・ Szymanów, Trzebnica County ・ Szymanów, Wrocław County Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Szymanski's conjecture ： ウィキペディア英語版 Szymanski's conjecture In mathematics, Szymanski's conjecture, named after , states that every permutation on the ''n''-dimensional doubly directed hypercube graph can be routed with edge-disjoint paths. That is, if the permutation σ matches each vertex ''v'' to another vertex σ(''v''), then for each ''v'' there exists a path in the hypercube graph from ''v'' to σ(''v'') such that no two paths for two different vertices ''u'' and ''v'' use the same edge in the same direction. Through computer experiments it has been verified that the conjecture is true for ''n'' ≤ 4 . Although the conjecture remains open for ''n'' ≥ 5, in this case there exist permutations that require the use of paths that are not shortest paths in order to be routed . ==References== *. *. *. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Szymanski's conjecture」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.